Operator means deformed by a fixed point method
نویسندگان
چکیده
منابع مشابه
A Characterisation of the Least-Fixed-Point Operator by Dinaturality
Simpson, A.K., A characterisation of the least-fixed-point operator by dinaturality, Theoretical Computer Science 118 (1993) 301-314. The paper addresses the question of when the least-fixed-point operator, in a Cartesian-closed category of domains, is characterised as the unique dinatural transformation from the exponentiation bifunctor to the identity functor. We give a sufficient condition o...
متن کاملGirard's $!()$ as a reversible fixed-point operator
We give a categorical description of the treatment of the !() exponential in the Geometry of Interaction system, with particular emphasis on the fact that the GoI interpretation 'forgets types'. We demonstrate that it may be thought of as a fixed-point operation for reversible logic & computation.
متن کاملA Common Fixed Point Theorem Using an Iterative Method
Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...
متن کاملFixed Point of the Parabolic Renormalization Operator
Any books that you read, no matter how you got the sentences that have been read from the books, surely they will give you goodness. But, we will show you one of recommendation of the book that you need to read. This fixed point of the parabolic renormalization operator is what we surely mean. We will show you the reasonable reasons why you need to read this book. This book is a kind of preciou...
متن کاملOn Gabbay's Temporal Fixed Point Operator
We discuss the temporal logic ‘USF’, involving Until, Since and the fixed point operator φ of Gabbay, with semantics over the natural numbers. We show that any formula not involving Until is equivalent to one without nested fixed point operators. We then prove that USF has expressive power matching that of the monadic second-order logic S1S. The proof shows that any USF-formula is equivalent to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Operator Theory
سال: 2020
ISSN: 2662-2009,2538-225X
DOI: 10.1007/s43036-019-00034-9